首页> 外文OA文献 >Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
【2h】

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

机译:通过网格死锁检测模型上的邻居复制解决两个死锁周期

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

A data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that\udreceive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and also can enhance the performance of the system. However, during transaction deadlock may occur that can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. Approach: The Neighbor Replication\udon Grid Deadlock Detection (NRGDD) transaction model has been developed to handle two deadlock cycle problems on grid. By deploying this method, the transactions communicate with each other by passing the probe messages. The victim message has been used to detect the deadlock when the number of waiting resource by other transaction is highest and become as the cause of deadlock occurs. In addition, this transaction must be aborted to solve the problem. Results: NRGDD transaction model are able to detect and solve more than one cycle of deadlocks. Conclusion: NRGDD has resolve the deadlock problem by sending the minimum number of probes message to detect the deadlock and it can resolve the deadlock to ensure the transaction can be done smoothly.
机译:数据网格由数百台地理上分散的计算机组成,并且存储资源通常位于不同的位置,并使用户可以共享数据和其他资源。问题陈述:数据复制是管理数据网格体系结构的一种机制,由于它可以提供对数据的有效访问,容错能力,减少访问延迟并可以增强系统性能,因此引起了人们的特别关注。但是,在事务处理过程中可能会发生死锁,这会通过最小化可用资源来降低吞吐量,因此它成为分布式系统中的重要资源管理问题。方法:已开发了邻居复制\ udon网格死锁检测(NRGDD)事务模型来处理网格上的两个死锁周期问题。通过部署此方法,事务通过传递探测消息相互通信。当其他事务的等待资源数量最高并且成为发生死锁的原因时,受害消息已用于检测死锁。另外,必须中止该事务以解决问题。结果:NRGDD事务模型能够检测并解决多个死锁周期。结论:NRGDD通过发送最少数量的探测消息来检测死锁,从而解决了死锁问题,并且NRGDD可以解决死锁以确保事务能够顺利完成。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号